Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams
نویسندگان
چکیده
In this paper, we propose an algorithm based on Binary Decision Diagram (BDD) for computing all-terminal reliability. It is defined as the probability that the nodes in the network can communicate to each other, taking into account the possible failures of network links. The effectiveness of this approach is demonstrated by performing experiments on several large networks represented by stochastic graphs. 1
منابع مشابه
Comparison of Binary and Multi-Variate Hybrid Decision Diagram Algorithms for K-Terminal Reliability
The Ordered Binary Decision Diagram (OBDD) has been efficiently used to compute the communication network (CN) reliability (REL). The boundary set method (BS) is used to improve the efficiency of the OBDD approach, while the augmented OBDD diagrams (OBDD-A) that stores CN information in its nodes has been proposed to solve other CN performance metrics in addition to REL. The hybrid OBDD (OBDD-H...
متن کاملScenario Aggregation using Binary Decision Diagrams for Stochastic Programs with Endogenous Uncertainty
Modeling decision-dependent scenario probabilities in stochastic programs is difficult and typically leads to large and highly non-linear MINLPs that are very difficult to solve. In this paper, we develop a new approach to obtain a compact representation of the recourse function using a set of binary decision diagrams (BDDs) that encode a nested cover of the scenario set. The resulting BDDs can...
متن کاملSymbolic Representations and Analysis of Large Probabilistic Systems
This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by exploiting high-level structure and regularity in the models to which they are applied, increasing the size of the state spaces which can be tackled. In general, this is done by using data structures which provide compact stor...
متن کاملNew insights into breadth-first search edge ordering of regular networks for terminal-pair reliability analysis
In the binary decision diagram–based terminal-pair network reliability analysis, the size of binary decision diagram heavily depends on the chosen edge ordering. From a theoretical point of view, finding the best ordering is an intractable task. Therefore, heuristics have been used to obtain reasonably good orderings. Among them, the breadth-first search heuristic typically outperforms other he...
متن کاملTime-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams
This paper considers methods to design multiple-output networks based on decision diagrams (DDs). TDM (time-division multiplexing) systems transmit several signals on a single line. These methods reduce: 1) hardware; 2) logic levels; and 3) pins. In the TDM realizations, we consider three types of DDs: shared binary decision digrams (SBDDs), shared multiple-valued decision diagrams (SMDDs), and...
متن کامل